Synchronization and Graph Topology
نویسندگان
چکیده
This paper clarifies the relation between synchronization and graph topology. Applying the Connection Graph Stability method developed by Belykh et al. [2004a] to the study of synchronization in networks of coupled oscillators, we show which graph properties matter for synchronization. In particular, while we explicitly link the stability of synchronization with the average path length for a wide class of coupling graphs, we prove by a simple argument that the average path length is not always the crucial quantity for synchronization. We also show that synchronization in scale-free networks can be described by means of regular networks with a star-like coupling structure. Finally, by considering an example of coupled Hindmarsh–Rose neuron models, we demonstrate how global stability of synchronization depends on the parameters of the individual oscillator.
منابع مشابه
An Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملPhase synchronization control of complex networks of Lagrangian systems on adaptive digraphs
This paper presents a formation control and synchronization method that utilizes adaptive network topologies for a class of complex dynamical networks comprised of a large number of highly-nonlinear Euler–Lagrange (EL) systems. A time-varying and switching network topology, constructed by the adaptive graph Laplacian matrix, relaxes the standard requirement of consensus stability, even permitti...
متن کاملOn Synchronization of Interdependent Networks
Abstract It is well-known that the synchronization of diffusively-coupled systems on networks strongly depends on the network topology. In particular, the so-called algebraic connectivity μN−1, or the smallest non-zero eigenvalue of the discrete Laplacian operator plays a crucial role on synchronization, graph partitioning, and network robustness. In our study, synchronization is placed in the ...
متن کاملNonlinearly coupled harmonic oscillators: high frequency oscillations yield synchronization
Synchronization of coupled harmonic oscillators is investigated. Coupling considered here is pairwise, unidirectional, and described by a nonlinear function (whose graph resides in the first and third quadrants) of some projection of the relative distance (between the states of the pair being coupled) vector. Under the assumption that the interconnection topology defines a connected graph, it i...
متن کاملOn Synchronization of Interdependent Networks
Abstract It is well-known that the synchronization of diffusively-coupled systems on networks strongly depends on the network topology. In particular, the so-called algebraic connectivity μN−1, or the smallest non-zero eigenvalue of the discrete Laplacian operator plays a crucial role on synchronization, graph partitioning, and network robustness. In our study, synchronization is placed in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 15 شماره
صفحات -
تاریخ انتشار 2005